Some Results on Equi Independent Equitable Dominating Sets in Graph
نویسندگان
چکیده
منابع مشابه
Some results on maximal open sets
In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.
متن کاملSome results on Bipolar Fuzzy Graph
In this paper, the notion ofgraph operationsdisjunction and symmetric difference on bipolar fuzzy graphs are defined and it is proved that the new graph is a bipolar graph. Furthermore,the new concepts of bipolar fuzzy graphs calledupperstrong and lower strongbipolar fuzzy graphare introduced and some related </...
متن کاملSome results on functionally convex sets in real Banach spaces
We use of two notions functionally convex (briefly, F--convex) and functionally closed (briefly, F--closed) in functional analysis and obtain more results. We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$, then $bigcup_{alphain I}A_{alpha}$ is F--convex. Moreover, we introduce new definition o...
متن کاملOn Some Conjectures Concerning Critical Independent Sets of a Graph
Let G be a simple graph with vertex set V (G). A set S ⊆ V (G) is independent if no two vertices from S are adjacent. For X ⊆ V (G), the difference of X is d(X) = |X| − |N(X)| and an independent set A is critical if d(A) = max{d(X) : X ⊆ V (G) is an independent set} (possibly A = ∅). Let nucleus(G) and diadem(G) be the intersection and union, respectively, of all maximum size critical independe...
متن کاملOn Dominating Sets And Independent Sets Of Graphs
A k-dominating set is a set D k V such that every vertex i 2 V nD k has at least k i neighbours in D k. The k-domination number k (G) of G is the cardinality of a smallest k-dominating set of G. For k 1 = ::: = k n = 1, k-domination corresponds to the usual concept of domination. Our approach yields an improvement of an upper bound for the domination number found then the conception of k-domina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Research
سال: 2015
ISSN: 2070-0245,2070-0237
DOI: 10.3329/jsr.v7i3.23412